Provably Optimal Task Migration Time Using Alternative Routing Paths
نویسندگان
چکیده
Early experiments in migrating task images from one node in a metacomputing environment to another have shown, that it is possible to achieve almost maximum data throughput in LAN networks. With WAN-connected metacomputers however, the time spent in the task migration is not negligible. Here, alternative routing paths must be used concurrently to reduce the total migration time. We present a provably optimal method for minimizing the task migration time by splitting the task image into several packets that are sent concurrently along alternative paths. Our solution scheme is generic in that it can be applied to other ow problems found in heterogeneous computing, including optimal job migration and work-load balancing.
منابع مشابه
A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths
Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...
متن کاملFast Compaction in Hypercubes
Compaction relocates active subcubes in a fragmented hypercube so as to produce a contiguous free region and eliminate the adverse impact of fragmentation on performance. The overhead of compaction is often contributed primarily by task migration, which makes use of disjoint paths for transmitting migrated data. Since task migration usually involves transmitting a large amount of data, the time...
متن کاملOn-Line Task Migration in Hypercubes Through Double Disjoint Pats
Repeated subcube allocation and deallocation in hypercubes tend to cause fragmentation, which can be taken care of by task migration. Earlier task migration dealt with the establishment of a single path from each participating node for transmitting migrated information. The time required for migration with single paths is long, if a large amount of information is moved in hypercubes. This paper...
متن کاملProvably good performance-driven global routing
We propose a provably good performance-driven global routing algorithm for both cell-based and building-block design. The approach is based on a new bounded-radius minimum routing tree formulation. We first present several heuristics with good performance, based on an analog of Prim's minimum spanning tree construction. Next, we give an algorithm which simultaneously minimizes both routing cost...
متن کاملReal-Time Message Routing and Scheduling
Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions. In order for messages to meet their deadlines, one has to determine a suitable (short) origin-destination path for each message and resolve conflicts between messages whose paths share a communication link of the network. With...
متن کامل